access overhead造句

• Another important attribute of an ORAM construction is whether the access overhead is amortized or worst-case.
• Several of the earlier ORAM constructions have good amortized access overhead guarantees, but have \ Omega ( N ) worst-case access overheads.
• Several of the earlier ORAM constructions have good amortized access overhead guarantees, but have \ Omega ( N ) worst-case access overheads.
• One of the only known lower bounds on the access overhead of ORAMs is due to Goldreich et al . that relates this quantity with that of the size of sorting networks.
• The authors of also achieve an access overhead of O ( \ log ^ 3 n ), which is just a log-factor away from the best known ORAM access overhead.
• The authors of also achieve an access overhead of O ( \ log ^ 3 n ), which is just a log-factor away from the best known ORAM access overhead.